Partial differentiability on graphs

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Partial Differentiability of Invariant Splittings

A key feature of a general nonlinear partially hyperbolic dynamical system is the absence of differentiability of its invariant splitting. In this paper, we show that often partial derivatives of the splitting exist and the splitting depends smoothly on the dynamical system itself.

متن کامل

On Pseudo-differentiability

We present some new relations between the pseudo-derivatives and parabolic epiderivatives recently introduced by Rockafellar, and also its infinite dimensional counterparts. Significant extensions of the most important known results are proven, which further clarify the range of applicability of this new theory.

متن کامل

Partial Recovery on Random Regular Graphs

The problem of community detection from noisy observations of interactions between individuals has important applications to diverse areas such as biology, sociology, and computer science. This problem is particularly interesting when the number of interactions is on the order of the size of the populations, that is the graph where two interacting individuals are connected by an edge is sparse....

متن کامل

Nonlinear Elliptic Partial Difference Equations on Graphs

This article initiates the study of nonlinear elliptic partial difference equations (PdE) on graphs. We seek solutions u : V → R to the semilinear elliptic difference equation −Lu + f(u) = 0 on a graph G = (V,E), where L is the (negative) Laplacian on the graph G. We extend techniques used to prove existence theorems and derive numerical algorithms for the partial differential equation (PDE) ∆u...

متن کامل

On Θ-graphs of partial cubes

The Θ-graph Θ(G) of a partial cube G is the intersection graph of the equivalence classes of the Djoković-Winkler relation. Θ-graphs that are 2-connected, trees, or complete graphs are characterized. In particular, Θ(G) is complete if and only if G can be obtained from K1 by a sequence of (newly introduced) dense expansions. Θ-graphs are also compared with familiar concepts of crossing graphs a...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Malaya Journal of Matematik

سال: 2019

ISSN: 2319-3786,2321-5666

DOI: 10.26637/mjm0s01/0025